Improvement of Hierarchical Byzantine Fault Tolerance Algorithm in RAFT Consensus Algorithm Election

نویسندگان

چکیده

Currently, blockchain technology is not only gaining momentum in the financial industry but also showing promising developments other sectors. Due to its suitability for various societal needs, an increasing number of non-financial institutions are expanding scope services beyond finance areas such as healthcare service management and enterprise governance. The core a system lies consensus, which plays crucial role performance security. PBFT algorithm widely used fault-tolerant consensus algorithm. However, it suffers from issues like high latency, low throughput, poor performance. In recent years, HBFT has addressed these concerns. This paper proposes improved tailored large enterprises with multiple independent functions. goal achieve more efficient data election strategies that both secure than HBFT. Leveraging enhanced ensures stability efficiency verification processes between organizations. Additionally, enables value creation application context.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

A Byzantine Fault Tolerant Raft

Just like how Paxos is hard to understand, PBFT is also hard to understand. Therefore, we want to formulate a Byzantine Fault Tolerant distributed file system that is easy to understand. Therefore, we took inspiration from Raft, PBFT, as well as Blockchains (because it’s the latest fad) to create a simple BFT algorithm.

متن کامل

A Leader-Free Byzantine Consensus Algorithm

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not the case of benign faults, which raises the following fundamental question: is it possible to design a deterministic Byzantine consensus alg...

متن کامل

Byzantine Convex Consensus: An Optimal Algorithm

Much of the past work on asynchronous approximate Byzantine consensus has as-sumed scalar inputs at the nodes [4, 8]. Recent work has yielded approximate Byzantineconsensus algorithms for the case when the input at each node is a d-dimensional vector,and the nodes must reach consensus on a vector in the convex hull of the input vectorsat the fault-free nodes [9, 13]. The d-d...

متن کامل

Tangaroa: a Byzantine Fault Tolerant Raft

We propose a Byzantine Fault Tolerant variant of the Raft consensus algorithm, BFTRaft, inspired by the original Raft[1] algorithm and the Practical Byzantine Fault Tolerance algorithm[2]. BFT Raft maintains the safety, fault tolerance, and liveness properties of Raft in the presence of Byzantine faults, while also aiming towards to Raft’s goal of simplicity and understandability. We have imple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13169125